On the existence of zero-sum perfect matchings of complete graphs
نویسندگان
چکیده
In this paper, we prove that given a 2-edge-coloured complete graph K4n has the same number of edges each colour, can always find perfect matching with an equal colour. This solves problem posed by Caro, Hansberg, Lauri, and Zarb. The is also independently solved Ehard, Mohr, Rautenbach.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملPerfect Matchings of Cellular Graphs
We introduce a family of graphs, called cellular, and consider the problem of enumerating their perfect matchings. We prove that the number of perfect matchings of a cellular graph equals a power of 2 tiroes the number of perfect matchings of a certain subgraph, called the core of the graph. This yields, as a special case, a new proof of the fact that the Aztec diamond graph of order n introduc...
متن کاملResonance Graphs and Perfect Matchings of Graphs on Surfaces
Let G be a graph embedded in a surface and let F be a set of even faces of G (faces bounded by a cycle of even length). The resonance graph of G with respect to F, denoted by R(G;F), is a graph such that its vertex set is the set of all perfect matchings of G and two vertices M1 and M2 are adjacent to each other if and only if the symmetric difference M1 ⊕M2 is a cycle bounding some face in F. ...
متن کاملOn Counting Perfect Matchings in General Graphs
Counting perfect matchings has played a central role in the theory of counting problems. The permanent, corresponding to bipartite graphs, was shown to be #P-complete to compute exactly by Valiant (1979), and a fully polynomial randomized approximation scheme (FPRAS) was presented by Jerrum, Sinclair, and Vigoda (2004) using a Markov chain Monte Carlo (MCMC) approach. However, it has remained a...
متن کاملOn Perfect Matchings in Matching Covered Graphs
Let G be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subsetX ofG is feasible if there exists two perfect matchingsM1 andM2 such that |M1∩X| 6≡ |M2∩X| (mod 2). Lukot’ka and Rollová proved that an edge subset X of a regular bipartite graph is not feasible if and only if X is switching-equivalent to ∅, and they further ask whether a non-feasible set of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2023
ISSN: ['1855-3974', '1855-3966']
DOI: https://doi.org/10.26493/1855-3974.2573.90d